Can online trading algorithms beat the market? An experimental evaluation
نویسندگان
چکیده
From experimental evaluation, we reasonably infer that online trading algorithms can beat the market. We consider the scenario of trading in financial market and present an extensive experimental study to answer the question “Can online trading algorithms beat the market?”. We evaluate the selected set of online trading algorithms on DAX30 and measure the performance against buy-and-hold strategy. In order to compute the experimentally achieved competitive ratio, we also compare the set of algorithms against an optimum offline algorithm. To add further dimensionality into experimental setup, we use trading periods of various lengths and apply a number of evaluation criteria (such as annualized geometric returns, average period returns and experimentally achieved competitive ratio) to measure the performance of algorithms in short vs. long term investment decisions. We highlight the best and worst performing algorithms and discuss the possible reasons for the performance behavior of algorithms. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity
منابع مشابه
Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional expert advice and “universal” algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of tec...
متن کاملIs It Necessary to Restrict Forex Financial Trading? A Modified Model
The Central Bank of Iran banned online currency trading through Forex brokers in November 2016. However, some Iranian speculators still trade in the online Forex market. Is this prohibition on Forex trading reasonable? According to reports, the majority of Forex day traders fail and leave the market within six months to a year. Some scholars attribute this failure to the changeable characterist...
متن کاملElectronic transaction processes on agrifood markets: experimental experiences and evaluation
Electronically supported transaction processes may lead to efficiency gains and cost reductions enhancing the operational effectiveness. Electronic trade systems improve coordination between buyers and sellers and increase transaction efficiency. The paper shows an exemplary agrifood market with a comparatively high level of inefficiency where electronic trading could benefit participating ente...
متن کاملUniversal Algorithm for Online Trading Based on the Method of Calibration
We present a universal algorithm for online trading in Stock Market which performs asymptotically at least as good as any stationary trading strategy that computes the investment at each step using a fixed function of the side information that belongs to a given RKHS (Reproducing Kernel Hilbert Space). Using a universal kernel, we extend this result for any continuous stationary strategy. In th...
متن کاملCompetitive Algorithms for Unbounded One-Way Trading
In the one-way trading problem, a seller has some product to be sold to a sequence σ of buyers u1, u2, . . . , uσ arriving online and he needs to decide, for each ui, the amount of product to be sold to ui at the then-prevailing market price pi. The objective is to maximize the seller’s revenue. We note that most previous algorithms for the problem need to impose some artificial upper bound M a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012